Modal Logic Should Say More Than It Does
نویسنده
چکیده
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, as well as the well-known problems with equality, non-rigid designators, definite descriptions, and nondesignating terms. We show how all these problems disappear when modal language is made more expressive in a simple, natural way. We present a semantic tableaux system for the enhanced logic, and (very) briefly discuss implementation issues.
منابع مشابه
Which Modal Logic Is the Right One?
The question, “Which modal logic is the right one for logical necessity?,” divides into two questions, one about model-theoretic validity, the other about proof-theoretic demonstrability. The arguments of Halldén and others that the right validity argument is S5, and the right demonstrability logic includes S4, are reviewed, and certain common objections are argued to be fallacious. A new argum...
متن کاملRights Revisited, and Limited
One of the most justly famous result of social choice theory is Sen’s Theorem on the impossibility of a Paretian liberal. In two recent papers, Salles introduced the notion of limited rights both in an aggregation function framework and in a social choice function framework. He then proved Sen-type impossibility theorems. In the aggregation function framework an individual has a ‘right’ if when...
متن کاملSpeaking about Transitive Frames in Propositional Languages
This paper is a comparative study of the propositional intuitionistic (non-modal) and classical modal languages interpreted in the standard way on transitive frames. It shows that, when talking about these frames rather than conventional quasi-orders, the intuitionistic language displays some unusual features: its expressive power becomes weaker than that of the modal language, the induced cons...
متن کاملDistributed Contingency Logic and Security
In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...
متن کاملThe decision problem of provability logic with only one atom
The decision problem for provability logic remains PSPACE -complete even if the number of propositional atoms is restricted to one. In some cases the set of all tautologies of a modal logic is in coNP. An example of a logic like that is the well-known S5. However, most of the traditional modal systems, including S4 and T, have PSPACE -complete decision problem. So one can say that adding modali...
متن کامل